Computational complexity in electronic structure
نویسندگان
چکیده
منابع مشابه
Computational Complexity in Electronic Structure
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere shortcomings of the algorithm designers and programmers but could stem from the inherent difficulty of simulating quantum systems. Extensions of computer science and ...
متن کاملElectronic Colloquium on Computational Complexity on Rank vs. Communication Complexity
This paper concerns the open problem of Lovasz and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We rst give an example exhibiting the largest gap known. We then prove two related theorems. y Extended Abstract appeared in FOCS 1994. subject "MAIL ME CLEAR", body "pub/eccc/ftpmail.txt" followed by an empty line, ...
متن کاملElectronic Colloquium on Computational Complexity Complexity Theory and Genetics
We introduce a population genetics model in which the operators are eeectively computable { computable in polynomial time on Probabilistic Turing Machines. We shall show that in this model a population can encode easily large amount of information from enviroment into genetic code. Then it can process the information as a paralel computer. More precisely, we show that it can simulate polynomial...
متن کاملStructure vs Combinatorics in Computational Complexity
Some computational problems seem to have a certain “structure” that is manifested in non-trivial algorithmic properties, while others are more “unstructured” in the sense that they are either “very easy” or “very hard”. I survey some of the known results and open questions about this classification and its connections to phase transitions, average-case complexity, quantum computing and cryptogr...
متن کاملThe Computational Complexity of Structure-Based Causality
Halpern and Pearl introduced a definition of actual causality; Eiter and Lukasiewicz showed that computing whether X = x is a cause of Y = y is NP-complete in binary models (where all variables can take on only two values) and Σ2 -complete in general models. In the final version of their paper, Halpern and Pearl slightly modified the definition of actual cause, in order to deal with problems po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Phys. Chem. Chem. Phys.
سال: 2013
ISSN: 1463-9076,1463-9084
DOI: 10.1039/c2cp42695a